Abelian varieties isogenous to a power of an elliptic curve
نویسندگان
چکیده
منابع مشابه
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties of small dimension. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particul...
متن کاملIndex calculus for abelian varieties and the elliptic curve discrete logarithm problem
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particular, our attack can ...
متن کاملOn Isogenous Principally Polarized Abelian Surfaces
We study a relationship between two genus 2 curves whose jacobians are isogenous with kernel equal to a maximal isotropic subspace of p-torsion points with respect to the Weil pairing. For p = 3 we find an explicit relationship between the set of Weierstrass points of the two curves extending the classical results of F. Richelot (1837) and G. Humbert (1901) in the case p = 2.
متن کاملLow Power Elliptic Curve Cryptography
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euc...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Compositio Mathematica
سال: 2018
ISSN: 0010-437X,1570-5846
DOI: 10.1112/s0010437x17007990